MULTI-TERMINAL 0-1 FLOWSHILOACH Y.1979; S.I.A.M.J. COMPUTG; USA; DA. 1979; VOL. 8; NO 3; PP. 422-430; BIBL. 2 REF.Article

STRONG LINEAR ORDERINGS OF A DIRECTED NETWORKSHILOACH Y.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 8; NO 3; PP. 146-148; BIBL. 3 REF.Article

A MULTI-TERMINAL MINIMUM CUT ALGORITHM FOR PLANAR GRAPHSSHILOACH Y.1980; S.I.A.M. J. COMPUTG.; USA; DA. 1980; VOL. 9; NO 2; PP. 219-224; BIBL. 3 REF.Article

FINDING THE MAXIMUM, MERGING AND SORTING IN A PARALLEL COMPUTATION MODELSHILOACH Y.1981; J. ALGORITHMS; ISSN 0196-6774; USA; DA. 1981; VOL. 2; NO 1; PP. 88-102; BIBL. 17 REF.Article

EDGE-DISJOINT BRANCHING IN DIRECTED MULTIGRAPHSSHILOACH Y.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 8; NO 1; PP. 24-27; BIBL. 10 REF.Article

FAST CANONIZATION OF CIRCULAR STRINGSSHILOACH Y.1981; J. ALGORITHMS; ISSN 0196-6774; USA; DA. 1981; VOL. 2; NO 2; PP. 107-121; BIBL. 5 REF.Article

ANOTHER LOOK AT THE DEGREE CONSTRAINED SUBGRAPH PROBLEMSHILOACH Y.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 12; NO 2; PP. 89-92; BIBL. 5 REF.Article

A POLYNOMIAL TIME ALGORITHM FOR SOLVING SYSTEMS OF LINEAR INEQUALITIES WITH TWO VARIABLES PER INEQUALITYASPVALL B; SHILOACH Y.1980; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1980; VOL. 9; NO 4; PP. 827-845; BIBL. 14 REF.Article

AN O(LOG N) PARALLEL CONNECTIVITY ALGORITHMSHILOACH Y; VISHKIN U.1982; J. ALGORITHMS; ISSN 0196-6774; USA; DA. 1982; VOL. 3; NO 1; PP. 57-67; BIBL. 4 REF.Article

A FAST ALGORITHM FOR SOLVING SYSTEMS OF LINEAR EQUATIONS WITH TWO VARIABLES PER EQUATIONASPVALL B; SHILOACH Y.1980; LINEAR ALGEBRA & APPL.; ISSN 0024-3795; USA; DA. 1980; VOL. 34; PP. 117-124; BIBL. 6 REF.Article

FINDING THE MAXIMUM, MERGING AND SORTING IN A PARALLEL COMPUTATION MODELSHILOACH Y; VISHKIN U.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 111; PP. 314-327; BIBL. 16 REF.Conference Paper

FINDING TWO DISJOINT PATHS BETWEEN TWO PAIRS OF VERTICES IN A GRAPH.PERL Y; SHILOACH Y.1978; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1978; VOL. 25; NO 1; PP. 1-9; BIBL. 11 REF.Article

AN O(N² LOG N) PARALLEL MAX-FLOW ALGORITHMSHILOACH Y; VISHKIN U.1982; JOURNAL OF ALGORITHMS; ISSN 0196-6774; USA; DA. 1982; VOL. 3; NO 2; PP. 128-146; BIBL. 23 REF.Article

THE COMPLEXITY OF FINDING MAXIMUM DISJOINT PATHS WITH LENGTH CONTRAINTSITAI A; PERL Y; SHILOACH Y et al.1982; NETWORKS; ISSN 0028-3045; USA; DA. 1982; VOL. 12; NO 3; PP. 277-286; BIBL. 9 REF.Article

GOLDEN RATIOS IN A PAIRS COVERING PROBLEMSHILOACH Y; VISHKIN U; ZAKS S et al.1982; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1982; VOL. 41; NO 1; PP. 57-65; BIBL. 2 REF.Article

COMPUTER-ASSISTED EXAMINATION OF CHEMICAL COMPOUNDS FOR STRUCTURAL SIMILARITIESVARKONY TH; SHILOACH Y; SMITH DH et al.1979; J. CHEM. INFORM. COMPUTER SCI.; USA; DA. 1979; VOL. 19; NO 2; PP. 104-111; BIBL. 13 REF.Article

New connectivity and MSF algorithms for shuffe-exchange network and PRAMAWERBUCH, B; SHILOACH, Y.IEEE transactions on computers. 1987, Vol 36, Num 10, pp 1258-1263, issn 0018-9340Article